Excluding a Long Double Path Minor
نویسندگان
چکیده
منابع مشابه
Excluding a Long Double Path Minor
The ``height'' of a graph G is defined to be the number of steps to construct G by two simple graph operations. Let Bn be the graph obtained from an n-edge path by doubling each edge in parallel. Then, for any minor-closed class G of graphs, the following are proved to be equivalent: (1) Some Bn is not in G; (2) There is a number h such that every graph in G has height at most h; (3) G is well-...
متن کاملExcluding a small minor
There are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we discuss the structure of graphs that do not contain a minor isomorphic to H.
متن کاملExcluding A Grid Minor In Planar Digraphs
In [1] we introduced the notion of tree-width of directed graphs and presented a conjecture, formulated during discussions with Noga Alon and Bruce Reed, stating that a digraph of huge tree-width has a large “cylindrical grid” minor. Here we prove the conjecture for planar digraphs, but many steps of the proof work in general. This is an unedited and unpolished manuscript from October 2001. Sin...
متن کاملTuring Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
The notion of Turing kernelization investigates whether a polynomial-time algorithm can solve an NP-hard problem, when it is aided by an oracle that can be queried for the answers to bounded-size subproblems. One of the main open problems in this direction is whether k-Path admits a polynomial Turing kernel: can a polynomial-time algorithm determine whether an undirected graph has a simple path...
متن کاملCliques in Graphs Excluding a Complete Graph Minor
This paper considers the following question: What is the maximum number of k-cliques in an n-vertex graph with no Kt-minor? This question generalises the extremal function for Kt-minors, which corresponds to the k = 2 case. The exact answer is given for t 6 9 and all values of k. We also determine the maximum total number of cliques in an n-vertex graph with no Kt-minor for t 6 9. Several obser...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1996
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.0002